/*
 * Copyright 2020-2030 the original author or authors.
 *
 * Licensed under the Apache License, Version 2.0 (the "License");
 * you may not use this file except in compliance with the License.
 * You may obtain a copy of the License at
 *
 *      https://www.apache.org/licenses/LICENSE-2.0
 *
 * Unless required by applicable law or agreed to in writing, software
 * distributed under the License is distributed on an "AS IS" BASIS,
 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
 * See the License for the specific language governing permissions and
 * limitations under the License.
 */

package com.wwl.stack;

import java.util.LinkedList;
import java.util.Queue;

public class QueuedStack<T> {

    private final Queue<T> q;

    public QueuedStack() {
        q = new LinkedList<>();
    }

    public boolean empty() {
        return q.isEmpty();
    }

    public void push(T t) {
        q.add(t);
        for (int i = 1; i < q.size(); i++) {
            q.add(q.remove());
        }
    }

    public T pop() {
        return q.remove();
    }

    public T top() {
        return q.peek();
    }

}
